A General Method for Forbidden Induced Subgraph Sandwich Problem NP-completeness
نویسندگان
چکیده
منابع مشابه
On the forbidden induced subgraph sandwich problem
Weconsider the sandwich problem, a generalization of the recognition problem introduced by Golumbic et al. (1995) [15], with respect to classes of graphs defined by excluding induced subgraphs. We prove that the sandwich problem corresponding to excluding a chordless cycle of fixed length k is NP-complete. We prove that the sandwich problem corresponding to excluding Kr \ e for fixed r is polyn...
متن کاملA General NP Completeness Theorem
A detailed model of a random access computation over an ab stract domain is presented and the existence of an NP complete problem is proven under broad conditions which unify Cook s theorem and recent results in the real number model by Blum Shub and Smale
متن کاملOn the NP-completeness of the perfect matching free subgraph problem
Given a bipartite graph G = (U ∪ V , E) such that | U |=| V | and every edge is labelled true or false or both, the perfect matching free subgraph problem is to determine whether or not there exists a subgraph of G containing, for each node u of U , either all the edges labelled true or all the edges labelled false incident to u, and which does not contain a perfect matching. This problem arise...
متن کاملNP-completeness Proof: RBCDN Reduction Problem
Suppose {R1, . . . , Rk} is the set of all possible regions [?] of graph G. Consider a k-dimensional vector C whose i-th entry, C[i], indicates the number of connected components in which G decomposes when all nodes in Ri fails. Then, region-based component decomposition number (RBCDN) of graphG with region R is defined as αR(G) = max1≤i≤k C[i]. Suppose the RBCDN of G with region R is αR(G). If...
متن کاملNP-Completeness: A Retrospective
For a quarter of a century now NP completeness has been computer science s favorite paradigm fad punching bag buzzword alibi and intellectual export This paper is a fragmentary commentary on its origins its nature its impact and on the attributes that have made it so pervasive and contagious A keyword search in Melvyl the University of California s on line library reveals that about papers each...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2019
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2019.08.035